Over the recent years, one of the important aspects of cloud computing is the dynamic scheduling of a large number of task requests which are submitted with variable rate by users. Task scheduling plays a key role in cloud computing systems, and this type of scheduling can not be done on a single criterion, but many rules and conditions must be considered as an agreement between users and cloud providers. In fact, this agreement is the quality of the services that users expect from providers. Cloud data centers should not only execute these huge tasks, but also should meet the multiple needs of different users. In this paper, a multi-objective task scheduling strategy is proposed using non-dominated sorting, calculate normal and threshold rates. The aim of the proposed approach is considering some of the most important criteria for quality of service at the time of tasks execution, that means deadline and cost. In addition, the cloud elasticity property is considered. The simulation results show improvement in the conditions of makespan, cost, mean utilization of virtual machines and deadlines violation compared to MultiObjective, FCFS, Min-Min, Priority Schedulig and MOF approaches.

The sewer layout in flat areas significantly influences the construction and operational costs as well as reliability of the network performance. To find an optimum design of sewer networks for flat areas, this study presents a multi-objective optimization problem with the objective functions of 1- the cost and 2- the reliability. The reliability criterion is defined as the effect of a clogging in a sewer on its upstream population. To solve the problem, the NSGA-II Algorithm is coupled to two self-adaptive design algorithms for generating the layout and sizing of sewers. A case study is solved using the proposed model to demonstrate its application and advantages.

Generally, an engineering design problem has multiple objective functions. Some of these problems can be formulated as multiobjective geometric programming models. On the other hand, often in the real world, coefficients of the objective functions are not known precisely. Coefficients may be interpreted as fuzzy numbers, which lead to a multiobjective geometric programming with fuzzy parameters. In this paper, we solve the multiobjective geometric programming problem with fuzzy parameters by applying a linear ranking function. The linear ranking function is used to compare fuzzy numbers. Finally, a numerical example is given.

A multiobjective security game problem with fuzzy payoffs is studied in this paper. The problem is formulated as a bilevel programming problem with fuzzy coefficients. Using the idea of nearest interval approximation of fuzzy numbers, the problem is transformed into a bilevel programming problem with interval coefficients. The Karush-Kuhn-Tucker conditions is applied then to reduce the problem to an interval multiobjective single-level problem. It is shown that the solutions of this problem are obtained by solving a single-objective programming problem. Validity and applicability of the method are illustrated by a practical example.